On the minimum distance graph of an extended Preparata code
نویسندگان
چکیده
منابع مشابه
On the minimum distance graph of an extended Preparata code
The minimum distance graph of an extended Preparata code P (m) has vertices corresponding to codewords and edges corresponding to pairs of codewords that are distance 6 apart. The clique structure of this graph is investigated and it is established that the minimum distance graphs of two extended Preparata codes are isomorphic if and only if the codes are equivalent.
متن کاملThe Minimum Distance of Graph Codes
We study codes constructed from graphs where the code symbols are associated with the edges and the symbols connected to a given vertex are restricted to be codewords in a component code. In particular we treat such codes from bipartite expander graphs coming from Euclidean planes and other geometries. We give results on the minimum distances of the codes.
متن کاملan investigation of the impact of self monitoring on langauge teachers motivational practice and its effect on learners motivation
the central purpose of this study was to conduct a case study about the role of self monitoring in teacher’s use of motivational strategies. furthermore it focused on how these strategies affected students’ motivational behavior. although many studies have been done to investigate teachers’ motivational strategies use (cheng & d?rnyei, 2007; d?rnyei & csizer, 1998; green, 2001, guilloteaux & d?...
On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes
This paper deals with the design of low-rate sparse-graph codes with linear minimum distance (dmin) in the blocklength. First, we define a necessary condition that a quite general family of graphical codes has to satisfy in order to have linear dmin.The condition generalizes results known for turbo codes [9] and LDPC codes. Secondly, we try to justify the necessity to introduce degree-1 bits (t...
متن کاملThe intractability of computing the minimum distance of a code
It is shown that the problem of computing the minimum distance of a binary linear code is NP-hard, and the corresponding decision problem is NP-complete. This result constitutes a proof of the conjecture of Berlekamp, McEliece, and van Tilborg, dating back to 1978. Extensions and applications of this result to other problems in coding theory are discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2010
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-009-9358-z